Three-valued Gauss periods, circulant weighing matrices and association schemes
نویسندگان
چکیده
Gauss periods taking exactly two values are closely related to two-weight irreducible cyclic codes and strongly regular Cayley graphs. They have been extensively studied in the work of Schmidt andWhite and others. In this paper, we consider the questionofwhenGauss periods take exactly three rational values.Weobtain numerical necessary conditions for Gauss periods to take exactly three rational values. We show that in certain cases, the necessary conditions obtained are also sufficient. We give numerous examples where the Gauss periods take exactly three values. Furthermore, we discuss connections between three-valued Gauss periods and combinatorial structures such as circulant weighing matrices and three-class association schemes. Dedicated to Chris Godsil, on the occasion of his 65th birthday T. Feng research supported in part by the Fundamental Research Funds for Central Universities of China and the National Natural Science Foundation of China under Grant 11422112. K. Momihara research supported by JSPS under Grant-in-Aid for Young Scientists (B) 25800093 and Scientific Research (C) 24540013. B Qing Xiang [email protected] Tao Feng [email protected] Koji Momihara [email protected] 1 Department of Mathematics, Zhejiang University, Hangzhou 310027, Zhejiang, People’s Republic of China 2 Faculty of Education, Kumamoto University, 2-40-1 Kurokami, Kumamoto 860-8555, Japan 3 Department of Mathematical Sciences, University of Delaware, Newark, DE 19716, USA
منابع مشابه
Some New Results on Circulant Weighing Matrices
We obtain a few structural theorems for circulant weighing matrices whose weight is the square of a prime number. Our results provide new schemes to search for these objects. We also establish the existence status of several previously open cases of circulant weighing matrices. More specifically we show their nonexistence for the parameter pairs (n, k) (here n is the order of the matrix and k i...
متن کاملOn circulant weighing matrices
Algebraic techniques are employed to obtain necessary conditions for the existence of certain circulant weighing matrices. As an application we rule out the existence of many circulant weighing matrices. We study orders n = 8 +8+1, for 10 ~ 8 ~ 25. These orders correspond to the number of points in a projective plane of order 8.
متن کاملDouble circulant codes from two class association schemes
Two class association schemes consist of either strongly regular graphs (SRG) or doubly regular tournaments (DRT). We construct self-dual codes from the adjacency matrices of these schemes. This generalizes the construction of Pless ternary Symmetry codes, Karlin binary Double Circulant codes, Calderbank and Sloane quaternary double circulant codes, and Gaborit Quadratic Double Circulant codes ...
متن کاملFiniteness of circulant weighing matrices of fixed weight
Let n be any fixed positive integer. Every circulant weighing matrix of weight n arises from what we call an irreducible orthogonal family of weight n. We show that the number of irreducible orthogonal families of weight n is finite and thus obtain a finite algorithm for classifying all circulant weighing matrices of weight n. We also show that, for every odd prime power q, there are at most fi...
متن کاملOn circulant and two-circulant weighing matrices
We employ theoretical and computational techniques to construct new weighing matrices constructed from two circulants. In particular, we construct W (148, 144), W (152, 144), W (156, 144) which are listed as open in the second edition of the Handbook of Combinatorial Designs. We also fill a missing entry in Strassler’s table with answer ”YES”, by constructing a circulant weighing matrix of orde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016